Compilation and Communication Strategies for Out-of-Core Programs on Distributed Memory Machines
نویسندگان
چکیده
منابع مشابه
Compilation and Communication Strategies for Out-of-Core Programs on Distributed Memory Machines
It is widely acknowledged that improving parallel I/O performance is critical for widespread adoption of high performance computing. In this paper, we show that communication in out-of-core distributed memory problems may require both inter-processor communication and le I/O. Thus, in order to improve I/O performance, it is necessary to minimize the I/O costs associated with a communication ste...
متن کاملData Access Reorganizations in Compiling Out-of-Core Data Parallel Programs on Distributed Memory Machines
This paper describes optimization techniques for translating out-of-core programs written in a data parallel language like HPF to message passing node programs with explicit parallel I/O. We rst discuss how an out-of-core program can be translated by extending the method used for translating in-core programs. We demonstrate that straightforward extension of in-core compilation techniques does n...
متن کاملEecient Compilation of Out-of-core Data Parallel Programs Eecient Compilation of Out-of-core Data Parallel Programs
Large scale scientiic applications, such as the Grand Challenge applications, deal with very large quantities of data. The amount of main memory in distributed memory machines is usually not large enough to solve problems of realistic size. This limitation results in the need for system and application software support to provide eecient parallel I/O for out-of-core programs. This paper describ...
متن کاملComparison of MPI Benchmark Programs on Shared Memory and Distributed Memory Machines (Point-to-Point Communication)
There are several benchmark programs available to measure the performance of MPI on parallel computers. The most common use of MPI benchmarks software are SKaMPI, Pallas MPI Benchmark, MPBench, Mpptest and MPIBench. It is interesting to analyze the differences between different benchmark. Presently, there have been few comparisons done between the different benchmarks. Thus, in this paper we di...
متن کاملHashing Strategies for Simulating Shared Memory on Distributed Memory Machines
We survey shared memory simulations on distributed memory machines (DMMs), that use universal hashing to distribute the shared memory cells over the memory modules of the DMM. We measure their quality in terms of delay, time-processor eeciency, memory contention (how many requests have to be satissed by one memory module per simulated step) and simplicity. Further we take into consideration dii...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1996
ISSN: 0743-7315
DOI: 10.1006/jpdc.1996.0148